Minimum perimeter rectangles that enclose congruent non-overlapping circles
نویسندگان
چکیده
منابع مشابه
Minimum perimeter rectangles that enclose congruent non-overlapping circles
We use computational experiments to find the rectangles of minimum perimeter into which a given number, n, of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings found, the circles form the usual regular square-grid or hexagonal patterns or their hybrids. However, for most values of n in the tested range n ≤ 5000, e.g., ...
متن کاملCovering a Square by Small Perimeter Rectangles
We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2m + 1)/(n + m(m + 1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m + 1) (or m2).
متن کاملPartitioning a rectangle into small perimeter rectangles
Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having th...
متن کاملMinimum-perimeter enclosures
We give the first polynomial-time algorithm for the problem of finding a minimumperimeter k-gon that encloses a given n-gon. Our algorithm is based on a simple structural result, that an optimal k-gon has at least one “flush” edge with the ngon. This allows one to reduce the problem to computing the shortest k-link path in a simple polygon. As a by-product we observe that the minimum-perimeter ...
متن کاملProgramming with Circles, Triangles and Rectangles
This paper proposes extending popular object-oriented programming languages such as C#, VB or Java with native support for XML. In our approach XML documents or document fragments become first class citizens. This means that XML values can be constructed, loaded, passed, transformed and updated in a type-safe manner. The type system extensions, however, are not based on XML Schemas. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.03.017